全文获取类型
收费全文 | 65668篇 |
免费 | 12529篇 |
国内免费 | 8929篇 |
学科分类
工业技术 | 87126篇 |
出版年
2024年 | 267篇 |
2023年 | 1171篇 |
2022年 | 2310篇 |
2021年 | 2453篇 |
2020年 | 2722篇 |
2019年 | 2279篇 |
2018年 | 2263篇 |
2017年 | 2657篇 |
2016年 | 3075篇 |
2015年 | 3693篇 |
2014年 | 4778篇 |
2013年 | 4573篇 |
2012年 | 5790篇 |
2011年 | 6022篇 |
2010年 | 4926篇 |
2009年 | 5060篇 |
2008年 | 5296篇 |
2007年 | 5751篇 |
2006年 | 4521篇 |
2005年 | 3697篇 |
2004年 | 2970篇 |
2003年 | 2366篇 |
2002年 | 1746篇 |
2001年 | 1351篇 |
2000年 | 1162篇 |
1999年 | 911篇 |
1998年 | 735篇 |
1997年 | 581篇 |
1996年 | 434篇 |
1995年 | 306篇 |
1994年 | 264篇 |
1993年 | 197篇 |
1992年 | 194篇 |
1991年 | 91篇 |
1990年 | 124篇 |
1989年 | 81篇 |
1988年 | 59篇 |
1987年 | 22篇 |
1986年 | 31篇 |
1985年 | 31篇 |
1984年 | 22篇 |
1983年 | 22篇 |
1982年 | 24篇 |
1981年 | 13篇 |
1980年 | 20篇 |
1979年 | 10篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低.为了提高效率,提出了一种基于MFQ的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性. 相似文献
112.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
113.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
114.
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm. 相似文献
115.
介绍了一个计算机远程控制系统的设计与实现,该系统采用客户机/服务器模式,实现远程屏幕的实时传输,采用LZW压缩算法对图像进行压缩传输,在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标,键盘的模拟方式对计算机进行实时控制。 相似文献
116.
天然气管网输配气量优化研究 总被引:2,自引:0,他引:2
天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率,需要对天然气管网系统的输配气量进行优化。为此,以天然气管网系统的最大流量为目标函数,同时考虑了管道强度、节点压力和流量限制等约束条件,建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上,提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例,采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明,所建立的数学模型和采用的混合遗传算法是可行和有效的,能够对天然气管网系统输配气量的调度运行起到指导作用。 相似文献
117.
Jennifer Spenader 《Journal of Logic, Language and Information》2003,12(3):351-368
There are three ways to refer to a fact from the complement of afactive verb: (1) Via abstract object anaphoric reference, or, witha full sentential complement that will be interpreted either (2) asa bound presupposition or (3) as triggering a presupposition of afact that will have to be accommodated. Spoken corpus examplesreveal that these three possibilities differ in relation to thetype of information they tend to contribute, and this has twoeffects. First, the information status of the fact and its role inthe discourse seem to affect the preference for one constructionover another in a particular context. Second, presupposed factivecomplements that need to be accommodated tend to be hearer-new andthe focus of the utterance, meaning that information structureseems to contribute to the felicity of accommodation ofpresupposed facts. 相似文献
118.
119.
Lie‐Fern Hsu 《Quality and Reliability Engineering International》2007,23(2):269-272
He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
120.
Akiyoshi Wakatani 《Parallel Computing》2004,30(12):1345-1359
It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.
In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively. 相似文献